Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Ensemble of SVMs for Incremental Learning

Identifieur interne : 001303 ( Main/Exploration ); précédent : 001302; suivant : 001304

Ensemble of SVMs for Incremental Learning

Auteurs : Zeki Erdem [Turquie] ; Robi Polikar [États-Unis] ; Fikret Gurgen [Turquie] ; Nejat Yumusak [Turquie]

Source :

RBID : ISTEX:5D6C5641F0031ED22B10AAEAC6BEBCD4C9E705C5

Abstract

Abstract: Support Vector Machines (SVMs) have been successfully applied to solve a large number of classification and regression problems. However, SVMs suffer from the catastrophic forgetting phenomenon, which results in loss of previously learned information. Learn + +  have recently been introduced as an incremental learning algorithm. The strength of Learn + +  lies in its ability to learn new data without forgetting previously acquired knowledge and without requiring access to any of the previously seen data, even when the new data introduce new classes. To address thecatastrophic forgetting problem and to add the incremental learning capability to SVMs, we propose using an ensemble of SVMs trained with Learn + + . Simulation results on real-world and benchmark datasets suggest that the proposed approach is promising.

Url:
DOI: 10.1007/11494683_25


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Ensemble of SVMs for Incremental Learning</title>
<author>
<name sortKey="Erdem, Zeki" sort="Erdem, Zeki" uniqKey="Erdem Z" first="Zeki" last="Erdem">Zeki Erdem</name>
</author>
<author>
<name sortKey="Polikar, Robi" sort="Polikar, Robi" uniqKey="Polikar R" first="Robi" last="Polikar">Robi Polikar</name>
</author>
<author>
<name sortKey="Gurgen, Fikret" sort="Gurgen, Fikret" uniqKey="Gurgen F" first="Fikret" last="Gurgen">Fikret Gurgen</name>
</author>
<author>
<name sortKey="Yumusak, Nejat" sort="Yumusak, Nejat" uniqKey="Yumusak N" first="Nejat" last="Yumusak">Nejat Yumusak</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:5D6C5641F0031ED22B10AAEAC6BEBCD4C9E705C5</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/11494683_25</idno>
<idno type="url">https://api.istex.fr/document/5D6C5641F0031ED22B10AAEAC6BEBCD4C9E705C5/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001553</idno>
<idno type="wicri:Area/Istex/Curation">001463</idno>
<idno type="wicri:Area/Istex/Checkpoint">000C12</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Erdem Z:ensemble:of:svms</idno>
<idno type="wicri:Area/Main/Merge">001339</idno>
<idno type="wicri:Area/Main/Curation">001303</idno>
<idno type="wicri:Area/Main/Exploration">001303</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Ensemble of SVMs for Incremental Learning</title>
<author>
<name sortKey="Erdem, Zeki" sort="Erdem, Zeki" uniqKey="Erdem Z" first="Zeki" last="Erdem">Zeki Erdem</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Turquie</country>
<wicri:regionArea>TUBITAK Marmara Research Center, Information Technologies Institute, 41470, Gebze – Kocaeli</wicri:regionArea>
<wicri:noRegion>Gebze – Kocaeli</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country xml:lang="fr">Turquie</country>
<wicri:regionArea>Computer Engineering Department, Sakarya University, Esentepe, 54187, Sakarya</wicri:regionArea>
<wicri:noRegion>Sakarya</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Turquie</country>
</affiliation>
</author>
<author>
<name sortKey="Polikar, Robi" sort="Polikar, Robi" uniqKey="Polikar R" first="Robi" last="Polikar">Robi Polikar</name>
<affiliation wicri:level="2">
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Electrical and Computer Engineering Department, Rowan University, 210 Mullica Hill Rd., 08028, Glassboro, NJ</wicri:regionArea>
<placeName>
<region type="state">New Jersey</region>
</placeName>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
<author>
<name sortKey="Gurgen, Fikret" sort="Gurgen, Fikret" uniqKey="Gurgen F" first="Fikret" last="Gurgen">Fikret Gurgen</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Turquie</country>
<wicri:regionArea>Computer Engineering Department, Bogazici University, Bebek, 80815, Istanbul</wicri:regionArea>
<wicri:noRegion>Istanbul</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Turquie</country>
</affiliation>
</author>
<author>
<name sortKey="Yumusak, Nejat" sort="Yumusak, Nejat" uniqKey="Yumusak N" first="Nejat" last="Yumusak">Nejat Yumusak</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Turquie</country>
<wicri:regionArea>Computer Engineering Department, Sakarya University, Esentepe, 54187, Sakarya</wicri:regionArea>
<wicri:noRegion>Sakarya</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Turquie</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2005</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">5D6C5641F0031ED22B10AAEAC6BEBCD4C9E705C5</idno>
<idno type="DOI">10.1007/11494683_25</idno>
<idno type="ChapterID">25</idno>
<idno type="ChapterID">Chap25</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: Support Vector Machines (SVMs) have been successfully applied to solve a large number of classification and regression problems. However, SVMs suffer from the catastrophic forgetting phenomenon, which results in loss of previously learned information. Learn + +  have recently been introduced as an incremental learning algorithm. The strength of Learn + +  lies in its ability to learn new data without forgetting previously acquired knowledge and without requiring access to any of the previously seen data, even when the new data introduce new classes. To address thecatastrophic forgetting problem and to add the incremental learning capability to SVMs, we propose using an ensemble of SVMs trained with Learn + + . Simulation results on real-world and benchmark datasets suggest that the proposed approach is promising.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Turquie</li>
<li>États-Unis</li>
</country>
<region>
<li>New Jersey</li>
</region>
</list>
<tree>
<country name="Turquie">
<noRegion>
<name sortKey="Erdem, Zeki" sort="Erdem, Zeki" uniqKey="Erdem Z" first="Zeki" last="Erdem">Zeki Erdem</name>
</noRegion>
<name sortKey="Erdem, Zeki" sort="Erdem, Zeki" uniqKey="Erdem Z" first="Zeki" last="Erdem">Zeki Erdem</name>
<name sortKey="Erdem, Zeki" sort="Erdem, Zeki" uniqKey="Erdem Z" first="Zeki" last="Erdem">Zeki Erdem</name>
<name sortKey="Gurgen, Fikret" sort="Gurgen, Fikret" uniqKey="Gurgen F" first="Fikret" last="Gurgen">Fikret Gurgen</name>
<name sortKey="Gurgen, Fikret" sort="Gurgen, Fikret" uniqKey="Gurgen F" first="Fikret" last="Gurgen">Fikret Gurgen</name>
<name sortKey="Yumusak, Nejat" sort="Yumusak, Nejat" uniqKey="Yumusak N" first="Nejat" last="Yumusak">Nejat Yumusak</name>
<name sortKey="Yumusak, Nejat" sort="Yumusak, Nejat" uniqKey="Yumusak N" first="Nejat" last="Yumusak">Nejat Yumusak</name>
</country>
<country name="États-Unis">
<region name="New Jersey">
<name sortKey="Polikar, Robi" sort="Polikar, Robi" uniqKey="Polikar R" first="Robi" last="Polikar">Robi Polikar</name>
</region>
<name sortKey="Polikar, Robi" sort="Polikar, Robi" uniqKey="Polikar R" first="Robi" last="Polikar">Robi Polikar</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001303 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001303 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:5D6C5641F0031ED22B10AAEAC6BEBCD4C9E705C5
   |texte=   Ensemble of SVMs for Incremental Learning
}}

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024